- proc|to|log|ic
- proc|to|log|ic «PROK tuh LOJ ihk», adjective.of or having to do with proctology.
Useful english dictionary. 2012.
proc|to|log|ic
Look at other dictionaries:
proc|to|log|i|cal — «PROK tuh LOJ uh kuhl», adjective. = proctologic. (Cf. ↑proctologic) … Useful english dictionary
log — log·an; log·a·rithm; log·a·rith·mic; log; log·ger; log·ger·head; log·ger·head·ed; log·gets; log·gia; log·gish; log·i·cal; log·i·cal·i·ty; log·i·cal·iza·tion; log·i·cal·ize; log·i·cism; log·i·cize; log·ic·less; log·i·co ; log·ics; log·man;… … English syllables
proctologic — proc·to·log·ic … English syllables
proctology — proc•tol•o•gy [[t]prɒkˈtɒl ə dʒi[/t]] n. med the branch of medicine dealing with the rectum and anus • Etymology: 1895–1900 proc to•log′ic tlˈɒdʒ ɪk proc to•log′i•cal, adj. proc•tol′o•gist, n … From formal English to slang
proctological — proc·to·log·i·cal … English syllables
cal — abi·o·log·i·cal; adre·no·cor·ti·cal; aero·bi·o·log·i·cal; aero·chem·i·cal; aero·log·i·cal; aero·med·i·cal; aero·nau·ti·cal; aero·phys·i·cal; aero·tech·ni·cal; aes·thet·i·cal·ly; afo·cal; ag·a·tho·kak·o·log·i·cal; ag·nat·i·cal·ly;… … English syllables
Proctology — A medical specialty that deals with disorders of the rectum and anus. * * * Surgical specialty concerned with the anus and rectum and their diseases. [procto + G. logos, study] * * * proc·tol·o·gy präk täl ə jē n, pl gies a branch of medicine… … Medical dictionary
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Reference range — Reference ranges edit in: blood urine CSF feces In health related fields, a reference range or reference interval usually describes the variations of a measurement or value in healthy i … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
